A Pictorial Description of Cole's Parallel Merge Sort
نویسنده
چکیده
A largely pictorial description is given of a variant of an ingenious parallel sorting algorithm due to Richard Cole. The new description strives to achieve greater simplicity by exploiting symmetries that were not explicit in the original exposition and that can be conveyed nicely with pictures. Not paying attention to constant factors allows an additional slight simplification of the algorithm.
منابع مشابه
Logarithmic Time Cost Optimal Parallel
When looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel sorting in the eld of theoretical computer science. Such \theoretical" algorithms are mainly described for the PRAM (Parallel Random Access Machine) model of computation 13, 26]. This paper shows h...
متن کاملParallel Merge Sort for Distributed Memory Architectures Parallel Merge Sort for Distributed Memory Architectures Ii Contents 1 Introduction 1 2 Cole's Parallel Merge Sort: the Crew Algorithm 1 3 Implementing the Crew Algorithm on a Distributed Memory Ar- Chitecture 7
Cole presented a parallel merge sort for the PRAM model that performs in O log n parallel steps using n processors He gave an algorithm for the CREW PRAM model for which the constant in the running time is small He also gave a more complex version of the algorithm for the EREWPRAM the constant factor in the running time is still moderate but not as small In this paper we give an approach to imp...
متن کاملParallel Solutions to Geometric Problems in the Scan Model of Computation
This paper describes several parallel algorithms that solve geometric problems. The algorithms are based on a vector model of computation|the scan-model. The purpose of this paper is both to show how the model can be used and to formulate a set of practical algorithms. The scan-model is based on a small set of operations on vectors of atomic values. It diiers from the PRAM models both in that i...
متن کاملComparison of parallel sorting algorithms
In our study we implemented and compared seven sequential and parallel sorting algorithms: bitonic sort, multistep bitonic sort, adaptive bitonic sort, merge sort, quicksort, radix sort and sample sort. Sequential algorithms were implemented on a central processing unit using C++, whereas parallel algorithms were implemented on a graphics processing unit using CUDA platform. We chose these algo...
متن کاملSorting in Parallel Database Systems
Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past published work has extensively focused on external sorting on uni-processors (serial external sorting), and internal sorting on multiprocessors (parallel i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009